Large survivable nets and the generalized prisms
نویسندگان
چکیده
منابع مشابه
The First and Second Zagreb Indices of Generalized Complementary Prisms
The first and second zagreb indices of a graph G are defined as M1(G) = ∑ uv∈E(G) [deg(u) + deg(v)] (or equivalently ∑ u∈V (G) [deg(u)2] and M2(G) = ∑ uv∈E(G) [deg(u)deg(v)] respectively. In this paper, we have obtained the first and second zagreb indices of the generalized complementary prisms Gm+n,Gm,n,G m,m and Gm,m. MSC: 05C15, 05C38.
متن کاملFast Approximation Algorithms for the Generalized Survivable Network Design Problem
In a standard f -connectivity network design problem, we are given an undirected graph G = (V,E), a cut-requirement function f : 2 → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ N such that x(δ(S)) ≥ f(S) for all S ⊆ V . We focus on the class of such problems where f is a proper function. This encodes many well-studied NP-hard problems such a...
متن کاملGRASP Algorithms for the Edge-survivable Generalized Steiner Problem
The design of a communication network where the connectivity between nodes must be kept even after failure of some links can be modeled as a Generalized Steiner Problem. It consists of computing the minimal cost subnetwork of a given feasible network where certain pairs of nodes must satisfy a number of disjoint connectivity requirements and is known to be an NP-Complete problem. This paper int...
متن کاملDecomposition of complete bipartite graphs into generalized prisms
A generalized prism, or more specifically an (0, j)-prism of order 2n (where n is even) is a cubic graph consisting of two cycles u The question of factorization of complete bipartite graphs into (0, j)-prisms was completely settled by the author and S. Cichacz. Some partial results have also been obtained by them and P. Kovar and S. Dib. We will present a decomposition for another class of (0,...
متن کاملModeling and Performance Evaluation of Energy Consumption in S-MAC Protocol Using Generalized Stochastic Petri Nets
One of the features of wireless sensor networks is that the nodes in this network have limited power sources. Therefore, assessment of energy consumption in these networks is very important. What has been common practice has been the use of traditional simulators to evaluate the energy consumption of the nodes in these networks. Simulators often have problems such as fluctuating output values i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00131-v